Cross-Market Model Adaptation with Pairwise Preference Data for Web Search Ranking
نویسندگان
چکیده
Machine-learned ranking techniques automatically learn a complex document ranking function given training data. These techniques have demonstrated the effectiveness and flexibility required of a commercial web search. However, manually labeled training data (with multiple absolute grades) has become the bottleneck for training a quality ranking function, particularly for a new domain. In this paper, we explore the adaptation of machine-learned ranking models across a set of geographically diverse markets with the market-specific pairwise preference data, which can be easily obtained from clickthrough logs. We propose a novel adaptation algorithm, PairwiseTrada, which is able to adapt ranking models that are trained with multi-grade labeled training data to the target market using the target-market-specific pairwise preference data. We present results demonstrating the efficacy of our technique on a set of commercial search engine data.
منابع مشابه
An Ensemble Click Model for Web Document Ranking
Annually, web search engine providers spend more and more money on documents ranking in search engines result pages (SERP). Click models provide advantageous information for ranking documents in SERPs through modeling interactions among users and search engines. Here, three modules are employed to create a hybrid click model; the first module is a PGM-based click model, the second module in a d...
متن کاملLearning to Explain Entity Relationships by Pairwise Ranking with Convolutional Neural Networks
Providing a plausible explanation for the relationship between two related entities is an important task in some applications of knowledge graphs, such as in search engines. However, most existing methods require a large number of manually labeled training data, which cannot be applied in large-scale knowledge graphs due to the expensive data annotation. In addition, these methods typically rel...
متن کاملA New Hybrid Method for Web Pages Ranking in Search Engines
There are many algorithms for optimizing the search engine results, ranking takes place according to one or more parameters such as; Backward Links, Forward Links, Content, click through rate and etc. The quality and performance of these algorithms depend on the listed parameters. The ranking is one of the most important components of the search engine that represents the degree of the vitality...
متن کاملDomain Specific Search by Ranking Model Adaptation Using Binary Classifier
Domain specific search focus on one area of knowledge. Applying broad based ranking algorithm to vertical search domains is not desirable. Broad based ranking model is built upon the data from multiple domains Vertical search engines use a focused crawler that attempts to index only relevant web pages to a pre defined topic. With Ranking Adaptation Model we can adapt an existing ranking model t...
متن کاملConsistency-driven approximation of a pairwise comparison matrix
The pairwise comparison method is an interesting technique for building a global ranking from binary comparisons. In fact, some web search engines use this method to quantify the importance of a set of web sites. The purpose of this paper is to search a set of priority weights from the preference information contained in a general pairwise comparison matrix; i.e., a matrix without consistency a...
متن کامل